Approximation algorithms for NP-hard optimization problems
نویسندگان
چکیده
In this chapter, we discuss approximation algorithms for optimization problems. An optimization problem consists in finding the best (cheapest, heaviest, etc.) element in a large set P, called the feasible region and usually specified implicitly, where the quality of elements of the set are evaluated using a function f(x), the objective function, usually something fairly simple. The element that minimizes (or maximizes) this function is said to be an optimal solution of the objective function at this element is the optimal value. optimal value = min{f(x) | x ∈ P} (1)
منابع مشابه
Fully Polynomial Time Approximation Schemes
Recall that the approximation ratio for an approximation algorithm is a measure to evaluate the approximation performance of the algorithm. The closer the ratio to 1 the better the approximation performance of the algorithm. It is notable that there is a class of NP-hard optimization problems, most originating from scheduling problems, for which there are polynomial time approximation algorithm...
متن کاملResult Veriication Algorithms for Optimization Problems
In this article we discuss the design of result veriication algorithms for optimization problems. In particular, we design time-optimal result veriication algorithms which verify the solution of all-pairs shortest paths, maximum-ow in a network, and matching problems. We prove that polynomial-time veriication algorithms for NP-complete problems do not exist exist, unless P = NP. Result veriicat...
متن کاملApproximation Algorithms for Combinatorial Optimization
In combinatorial optimization, the most important challenges are presented by problems belonging to the class NP-hard. For such problems no algorithm is known that can solve all instances in polynomial time. It is also strongly believed that no polynomial algorithm is capable of doing this. Although it is very difficult to solve exactly any of the NP-hard problems, some of them are amenable to ...
متن کاملHighly parallel approximations for inherently sequential problems
In this work we study classes of optimization problems that require inherently sequential algorithms to solve exactly but permit highly parallel algorithms for approximation solutions. NC is the class of computational problems decidable by a logarithmic space uniform family of Boolean circuits of bounded fan-in, polynomial size, and polylogarithmic depth. Such problems are considered both “effi...
متن کاملLec . 1 : Approximation Algorithms for NP - hard problems
In this course, we will be studying, as the title suggests, the approximability and inapproximability (limits of approximability) of different combinatorial optimization problems. All the problems we will be looking at will be ones that lack efficient algorithms and in particular will be NP-hard problems. The last two-three decades has seen remarkable progress in approximation algorithms for se...
متن کاملApproximation Algorithms for Maxsat
The main aim of NP-completeness theory is the analysis of intractabil-ity. Many optimization problems were rst proved to be NP-hard. Since the complete solution of these problems requires exponential time, polynomial time algorithms to nd \near-optimal" solutions, i.e., approximation algorithms, appear to be viable. In this paper we show the basic principles of Approximation Theory for NP-compl...
متن کامل